Self-stabilizing Checkpointing Algorithm in Ring Topology
نویسندگان
چکیده
If the variables used for the checkpointing algorithm have data faults, the algorithm may fail. In this paper, a selfstabilizing checkpointing algorithm is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiation of checkpointing and at most one data fault per process. However, several processes may be faulty.
منابع مشابه
Self-stabilizing algorithm for checkpointing in a distributed system
If the variables used for a checkpointing algorithm have data faults, the existing checkpointing and recovery algorithms may fail. In this paper, self-stabilizing data fault detecting and correcting, checkpointing, and recovery algorithms are proposed in a ring topology. The proposed data fault detection and correction algorithms can handle data faults; at most one per process, but in any numbe...
متن کاملAsynchronous Rollback Recovery in Cluster Based Multi Hop Mobile Ad Hoc Networks
The dynamic topology and constraints of limited resources in mobile ad hoc networks (MANETs) pose unique challenges to execution of processes as compared to traditional distributed systems. The failure probability of the computing process increases when the system scales up. The paper presents an algorithm for the asynchronous recovery of a mobile host in cluster based and multi hop MANETs usin...
متن کاملDistributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges
Labeling schemes for tree representation p. 13 Single-bit messages are insufficient in the presence of duplication p. 25 Safe composition of distributed programs communicating over order-preserving imperfect channels p. 32 Efficiently implementing LL/SC objects shared by an unknown number of processes p. 45 Placing a given number of base stations to cover a convex region p. 57 A state-space sea...
متن کاملSelf-Stabilizing -out-of- Exclusion
In this paper, self-stabilizing asynchronous distributed algorithms are given for the -out-ofexclusion problem, a generalization of the mutual exclusion problem, in which there are units of a resource, and any process can request up to units. We consider two network topologies, a tree and a unidirectional ring. The networks are anonymous except for one distinguished process. The ring algorithm ...
متن کاملMessage efficient global snapshot recording using a self stabilizing spanning tree in a MANET
Distributed snapshots are a significant paradigm for distributed systems. These are applied for constructing checkpoint protocols, apart from investigating, testing, or proving properties in distributed executions such as deadlocks and termination. Though a number of snapshot algorithms exist for traditional distributed systems, they cannot be directly applied to mobile ad hoc networks due to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005